Uniform asymptotics of some Abel sums arising in coding theory

نویسنده

  • Hsien-Kuei Hwang
چکیده

We derive uniform asymptotic expressions of some Abel sums appearing in some problems in coding theory and indicate the usefulness of these sums in other fields, like empirical processes, machine maintenance, analysis of algorithms, probabilistic number theory, queuing models, etc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On asymptotics of certain sums arising in coding theory

Recently, T. Kllve IEEE IT, 41, 1995] analyzed the average worst case probability of undetected error for linear n; k; q] codes of length n and dimension k over an alphabet of size q. The following sum S n = P n i=1 ? n i (i=n) i (1 ? i=n) n?i arose, which has also some other applications in coding theory, average case analysis of algorithms, and combinatorics. T. Kllve conjectured an asymptoti...

متن کامل

On Asymptotics of Certain Sums Arising in in Coding Theory

Recently, T. J(lpve [IEEE IT, 41, jOg51 analyzed the average worst case probability of undetected error for linear [n, k; q] codes of length n and dimension k over an alphabet of si7,c q. The following sum 5 n = I:i:=:l (7Hi/n)i(li/n)n-i arose, which has also some other applkations in codlng theory, average case analysis of algorithms, and combinatorics. T. IG!ilve conjectured an asymptotic exp...

متن کامل

Singularity Analysis and Asymptotics of Bernoulli Sums Singularity Analysis and Asymptotics of Bernoulli Sums Singularity Analysis and Asymptotics of Bernoulli Sums

The asymptotic analysis of a class of binomial sums that arise in information theory can be performed in a simple way by means of singularity analysis of generating functions. The method developed extends the range of applicability of singularity analysis techniques to combinatorial sums involving transcendental elements like logarithms or fractional powers. Analyse de singularit e et asymptoti...

متن کامل

Artin-Schreier Curves, Exponential Sums, and Coding Theory

Lachaud, G., Artin-Schreier curves, exponential sums, and coding theory, Theoretical Computer Science 94 (1992) 295-310. This is a survey of some results recently obtained on the distribution of the weights of some classical linear codes on the one hand, such as the dual of the Melas code, and the geometric BCH codes discovered by Goppa (subfield subcodes of Goppa codes) on the other hand. Thes...

متن کامل

On Asymptotics of Certain Recurrences Arising in Universal Coding

Ramanujan's Q-function, Lambert W-function, and the so called \tree function" T(z) deened implicitly by the equation T(z) = ze T(z) found applications in hashing, the birthday paradox problem, random mappings, caching, memory connicts, and so forth. Recently, several novel applications of these functions to information theory problems such as linear coding and universal portfolios were brought ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 263  شماره 

صفحات  -

تاریخ انتشار 2001